Видео с ютуба Theory Of Automata

1. Introduction, Finite Automata, Regular Expressions

PDA to CFG Conversion | Equivalence of PDA and CFG | Automata Theory| TOC | TAFL | FLAT

Why study theory of computation?

Regular Languages: Deterministic Finite Automaton (DFA)